منابع مشابه
Exact Algorithms for Weak Roman Domination
We investigate a domination-like problem from the exact exponential algorithms viewpoint. The classical Dominating Set problem ranges among one of the most famous and studied NP -complete covering problems [6]. In particular, the trivial enumeration algorithm of runtime O∗(2n) 4 has been improved to O∗(1.4864n) in polynomial space, and O∗(1.4689n) with exponential space [9]. Many variants of th...
متن کاملSort and Search: Exact algorithms for generalized domination
In 1994, Telle introduced the following notion of domination, which generalizes many domination-type graph invariants. Let σ and % be two sets of non negative integers. A vertex subset S ⊆ V of an undirected graph G = (V,E) is called a (σ, %)-dominating set of G if |N(v) ∩ S| ∈ σ for all v ∈ S and |N(v) ∩ S| ∈ % for all v ∈ V \S. In this paper, we prove that decision, optimization, and counting...
متن کاملParameterized and Exact Algorithms for Class Domination Coloring
A class domination coloring (also called cd-coloring) of a graph is a proper coloring such that for every color class, there is a vertex that dominates it. The minimum number of colors required for a cd-coloring of the graph G, denoted by χcd(G), is called the class domination chromatic number (cd-chromatic number) of G. In this work, we consider two problems associated with the cd-coloring of ...
متن کاملPerfect edge domination and efficient edge domination in graphs
Let G = (V; E) be a /nite and undirected graph without loops and multiple edges. An edge is said to dominate itself and any edge adjacent to it. A subset D of E is called a perfect edge dominating set if every edge of E \ D is dominated by exactly one edge in D and an e cient edge dominating set if every edge of E is dominated by exactly one edge in D. The perfect (e cient) edge domination prob...
متن کاملExact Algorithms for Annotated Edge Dominating Set in Cubic Graphs
Given a graph G = (V,E) together with a nonnegative integer requirement on vertices r : V → Z+, the annotated edge dominating set problem is to find a minimum set M ⊆ E such that, each edge in E −M is adjacent to some edge in M , and M contains at least r(v) edges incident on each vertex v ∈ V . The annotated edge dominating set problem is a natural extension of the classical edge dominating se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2011
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-011-9546-x